A pessimistic bilevel stochastic problem for elastic shape optimization

نویسندگان

چکیده

We consider pessimistic bilevel stochastic programs in which the follower maximizes over a fixed compact convex set strictly quadratic function, whose Hessian depends on leader's decision. The resulting random variable is evaluated by risk measure. Under assumptions including real analyticity of lower-level goal we prove existence optimal solutions. discuss an alternate model where leader hedges against solutions, and show that this case solvability can be guaranteed under weaker conditions both deterministic setting. approach applied to mechanical shape optimization problem decides material distribution minimize tracking-type cost functional, whereas chooses forces from admissible maximize compliance objective. considered stochastically perturbed actual construction phase. Computational results illustrate concept demonstrate interplay design testing.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pessimistic bilevel linear optimization

In this paper, we investigate the pessimistic bilevel linear optimization problem (PBLOP). Based on the lower level optimal value function and duality, the PBLOP can be transformed to a single-level while nonconvex and nonsmooth optimization problem. By use of linear optimization duality, we obtain a tractable and equivalent transformation and propose algorithms for computing global or local op...

متن کامل

Pessimistic Bilevel Optimization

We study a variant of the pessimistic bilevel optimization problem, which comprises constraints that must be satisfied for any optimal solution of a subordinate (lower-level) optimization problem. We present conditions that guarantee the existence of optimal solutions in such a problem, and we characterize the computational complexity of various subclasses of the problem. We then focus on probl...

متن کامل

Easier than We Thought – A Practical Scheme to Compute Pessimistic Bilevel Optimization Problem

In this paper, we present a new computation scheme for pessimistic bilevel optimization problem, which so far does not have any computational methods generally applicable yet. We first develop a tight relaxation and then design a simple scheme to ensure a feasible and optimal solution. Then, we discuss using this scheme to compute linear pessimistic bilevel problem and several variants. We also...

متن کامل

A Bilevel Shape Optimization Problem for the Exterior Bernoulli Free Boundary Value Problem

A bilevel shape optimization problem with the exterior Bernoulli free boundary problem as lower-level problem and the control of the free boundary as the upper-level problem is considered. Using the shape of the inner boundary as the control, we aim at reaching a specific shape for the free boundary. A rigorous sensitivity analysis of the bilevel shape optimization in the infinite-dimensional s...

متن کامل

Necessary Optimality Conditions in Pessimistic Bilevel Programming Necessary Optimality Conditions in Pessimistic Bilevel Programming

This paper is devoted to the so-called pessimistic version of bilevel programming programs. Minimization problems of this type are challenging to handle partly because the corresponding value functions are often merely upper (while not lower) semicontinuous. Employing advanced tools of variational analysis and generalized differentiation, we provide rather general frameworks ensuring the Lipsch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 2021

ISSN: ['0025-5610', '1436-4646']

DOI: https://doi.org/10.1007/s10107-021-01736-w